Complexity of Computations with Pfaffian and Noetherian Functions
نویسنده
چکیده
This paper is a survey of the upper bounds on the complexity of basic algebraic and geometric operations with Pfaffian and Noetherian functions, and with sets definable by these functions. Among other results, we consider bounds on Betti numbers of sub-Pfaffian sets, multiplicities of Pfaffian intersections, effective Lojasiewicz inequality for Pfaffian functions, computing frontier and closure of restricted semi-Pfaffian sets, constructing smooth stratifications and cylindrical cell decompositions (including an effective version of the complement theorem for restricted sub-Pfaffian sets), relative closures of non-restricted semi-Pfaffian sets and bounds on the number of their connected components, bounds on multiplicities of isolated solutions of systems of Noetherian equations.
منابع مشابه
Frontier and Closure of a Semi-Pfaffian Set
For a semi-Pfaffian set, i.e., a real semianalytic set defined by equations and inequalities between Pfaffian functions in an open domain G, the frontier and closure in G are represented as semi-Pfaffian sets. The complexity of this representation is estimated in terms of the complexity of the original set. Introduction. Pfaffian functions introduced by Khovanskii [K] are analytic functions sat...
متن کاملRelative Closure and the Complexity of Pfaffian Elimination
We introduce the “relative closure” operation on one-parametric families of semi-Pfaffian sets. We show that finite unions of sets obtained with this operation (“limit sets”) constitute a structure, i.e., a Boolean algebra closed under projections. Any Pfaffian expression, i.e., an expression with Boolean operations, quantifiers, equations and inequalities between Pfaffian functions, defines a ...
متن کاملMargarita Korovina
Pfaffian Hybrid Systems. Pfaffian hybrid systems, which we recently introduced in [18], are a sub-class of o-minimal hybrid systems which capture rich continuous dynamics and yet can be studied using finite bisimulations. In particular Pfaffian hybrid systems include hybrid systems with continuous dynamics definable by functions such as exp, sin, cos, and other trigonometric functions in approp...
متن کاملComplexity of Stratifications of Semi-Pfaffian Sets
An effective algorithm for a smooth (weak) stratification of a real semi-Pfaffian set is suggested, provided an oracle deciding consistency of a system of Pfaffian equations and inequalities is given. An explicit estimate of complexity of the algorithm and of the resulting stratification is given, in terms of the parameters of the Pfaffian functions defining the original semiPfaffian set. The a...
متن کاملOn the Number of Connected Components of the Relative Closure of a Semi-Pfaffian Family
The notion of relative closure (X, Y )0 of a semi-Pfaffian couple (X, Y ) was introduced by Gabrielov to give a description of the o-minimal structure generated by Pfaffian functions. In this paper, an effective bound is given for the number of connected components of (X, Y )0 in terms of the Pfaffian complexity of X and Y.
متن کامل